Squashing maximum packings of Kn with 8-cycles into maximum packings of Kn with 4-cycles
نویسندگان
چکیده
منابع مشابه
Maximum packings of Kn with k-stars
Given graphs G and H, we define an H-packing of G to be a partition of the edges of G into some copies of H along with a set of edges L, called the leave. An H-packing is called maximum when |L| is minimum, or equivalently, when the H-packing contains as many copies of H as possible. A k-star, denoted Sk, is defined to be the complete bipartite graph K1,k. In this paper we characterize the numb...
متن کاملCorrigendum: Maximum packings of Kn with hexagons
Example 4.31. (K16 , P) : P = {(1, 3,5,10,16,15), (1, 4, 6,13,14,11), (1,5, 7,12, 15,10),(1,16,12,10,9,14),(2,3,6,9,11,13),(2,4, 7,10,13,9), (2,5,13,7,11,10), (1, 6, 2, 7,3,8), (1, 7, 8, 11,6,12), (3, 13, 1,9,7,14), (2,11,3,10,6,14),(3,15,14,16,8,12),(4,9,16,7,15,11),(4,10,14,8,13,15), (4,13,16,11,5,14),(8,2,12,5,9,15),(16,3,9,12,4,5),(5,15,6,16,4,8)}; L {(5, 6), (6,7), (6, 8), (8,9), (8, 10), ...
متن کاملMaximum packings of Kn with hexagons
A complete solution of the maximum packing problem of Kn with hexagons is given.
متن کاملThe Doyen-Wilson theorem for maximum packings of Kn with 4-cycles
Necessary and sufficient conditions are given to embed a maximum packing of K,, with 4-cycles into a maximum packing of K, with 4-cycles, both when the leave of the given packing is preserved, and when the leave of the given packing is not necessarily preserved.
متن کاملAlmost Resolvable Maximum Packings of Complete Graphs with 4-Cycles
If the complete graph Kn has vertex set X , a maximum packing of Kn with 4-cycles, (X,C, L), is an edge-disjoint decomposition of Kn into a collection C of 4-cycles so that the unused edges (the set L) is as small a set as possible. Maximum packings of Kn with 4-cycles were shown to exist by Schönheim and Bialostocki (Can. Math. Bull. 18:703–708, 1975). An almost parallel class of a maximum pac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2014
ISSN: 0354-5180,2406-0933
DOI: 10.2298/fil1404887l